#include <iostream>
#include <unordered_map>
using namespace std;

int main() {
    unordered_map<int, int> map;
    int times; cin >> times;
    for (int i = 0; i < times; i++) {
        int curr; cin >> curr;
        if (map.find(curr) == map.end()) {
            map.insert(pair<int, int>(curr, 0));
        }
        else {
            map[curr]++;
        }
    }
    int result = 0;
    for (pair<int, int> valuePair : map) {
        result += valuePair.second;
    }
    cout << result;
    return 0;
}